#include<iostream>
using namespace std;
const int N = 5e5 + 10;
typedef long long LL;

LL w[N];
LL n, a, b;
bool check(int mid)
{
	//看看这个mid时间能否洗完
	LL cnt = 0;
	for (int i = 1;i <= n;i++)
	{
		if (w[i] <= a * mid) continue;

		LL x = w[i] - a * mid;
		cnt = cnt + x / b + (x % b == 0 ? 0 : 1);
	}
	return cnt <= mid;
}
int main()
{
	cin >> n >> a >> b;
	for (int i = 1;i <= n;i++)
	{
		cin >> w[i];
	}
	//二分答案
	LL l = 0;LL r =5e5;
	while (l < r)
	{
		LL mid = (l + r) / 2;
		if (check(mid)) r = mid;
		else l = mid + 1;
	}
	cout << l << endl;
	return 0;
}